A New Algorithm for MAX-2-SAT
نویسنده
چکیده
منابع مشابه
An efficient solver for weighted Max-SAT
We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality. We provide experimental evidence that our solver is very competi3 tive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers 4 on a wide range of instances. 5
متن کاملStudy of Lower Bound Functions for MAX-2-SAT
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the performance of these algorithms. Based on the study of these lower bound functions, we propose a new, liner-time lower bound function. We show that the new lower bound function is consistently and substantially better than...
متن کاملImproved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
We present novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, and provide experimental evidence that outperform the algorithm of Borchers & Furman on Max-2-SAT and weighted Max-2-SAT instances. Our algorithms decrease the time needed to solve an instance, as well as the number of backtracks, up to two orders of magnitude.
متن کاملApproximation algorithms for MAX 4 - SATand rounding procedures for semide nite programs
Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...
متن کاملApproximation Algorithm for Random MAX-kSAT
We provide a rigorous analysis of a greedy approximation algorithm for the maximum random k-SAT (MAX-R-kSAT) problem. The algorithm assigns variables one at a time in a predefined order. A variable is assigned TRUE if it occurs more often positively than negatively; otherwise, it is assigned FALSE. After each variable assignment, problem instance is simplified and a new variable is selected. We...
متن کاملA Comparison of Methods for Solving MAX-SAT Problems
We compare the performance of 3 approaches to the solution of MAX-SAT problems, including a version of the DavisPutnam-Loveland algorithm extended to solve MAX-SAT, an integer programming branch-and-cut algorithm and an algorithm for MAX-2-SAT problems based on a semide nite programming relation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 6 شماره
صفحات -
تاریخ انتشار 1999